Canonical RNA Pseudoknot Structures

نویسندگان

  • Gang Ma
  • Christian M. Reidys
چکیده

In this paper, we study k-noncrossing, sigma-canonical RNA pseudoknot structures with minimum arc-length greater or equal to four. Let T(k, sigma)([4])(n) denote the number of these structures. We derive exact enumeration results by computing the generating function T(k, sigma)([4])(z) = summation operator(n) T(k, sigma)([4])(n)z(n) and derive the asymptotic formulas T(k, 3)([4])(n) approximately c(k) n(-(k-1)(2)-(k-1/2)) (gamma(k, 3)([4]))(-n) for k = 3, ..., 9. In particular, we have for k = 3, T(3, 3)([4])(n) approximately c(3)n(-5)2.0348(n). Our results show that the set of biophysically relevant RNA pseudoknot structures is surprisingly small and suggest a new structure class as target for prediction algorithms.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Shapes of RNA Pseudoknot Structures

In this article, we study abstract shapes of k-noncrossing, σ-canonical RNA pseudoknot structures. We consider lv1k- and lv5k-shapes, which represent a generalization of the abstract π'- and π-shapes of RNA secondary structures introduced by Giegerich et al. Using a novel approach, we compute the generating functions of lv1k- and lv5k-shapes as well as the generating functions of all lv1k- and ...

متن کامل

RNA-LEGO: Combinatorial Design of Pseudoknot RNA

In this paper we enumerate k-noncrossing RNA pseudoknot structures with given minimum stack-length. We show that the numbers of k-noncrossing structures without isolated base pairs are significantly smaller than the number of all k-noncrossing structures. In particular we prove that the number of 3and 4-noncrossing RNA structures with stack-length ≥ 2 is for large n given by 311.2470 4! n(n−1)....

متن کامل

A Graph-Theoretical Approach for Partitioning RNA Secondary Structures into Pseudonotted and Pseudoknot-free Regions

Dual graphs have been applied to model RNA secondary structures with pseudoknots, or intertwined base pairs. In this paper we present a linear-time algorithm to partition dual graphs into topological components called blocks and determine whether each block contains a pseudoknot or not. We show that a block contains a pseudoknot if and only if the block has a vertex of degree 3 or more; this ch...

متن کامل

Loops in Canonical RNA Pseudoknot Structures

In this article, we compute the limit distributions of the numbers of hairpin-loops, interior-loops and bulges in k-noncrossing RNA structures. The latter are coarse-grained RNA structures allowing for cross-serial interactions, subject to the constraint that there are at most k - 1 mutually crossing arcs in the diagram representation of the molecule. We prove central limit theorems by means of...

متن کامل

Asymptotics of Canonical and Saturated RNA Secondary Structures

It is a classical result of Stein and Waterman that the asymptotic number of RNA secondary structures is 1.104366 . n(-3/2) . 2.618034(n). In this paper, we study combinatorial asymptotics for two special subclasses of RNA secondary structures - canonical and saturated structures. Canonical secondary structures are defined to have no lonely (isolated) base pairs. This class of secondary structu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Journal of computational biology : a journal of computational molecular cell biology

دوره 15 10  شماره 

صفحات  -

تاریخ انتشار 2008